On Parikh slender context-free languages
نویسنده
چکیده
In a recent paper we de ned and studied Parikh slender languages and showed that they can be used in simplifying ambiguity proofs of context-free languages. In this paper Parikh slender context-free languages are characterized. The characterization has diverse applications. TUCS Research Group Mathematical Structures of Computer Science
منابع مشابه
A Decision Method for Parikh Slenderness of Context-free Languages
In a recent paper we introduced Parikh slender languages as a generalization of slender languages defined and studied by AndraSiu, Dassow, Pgun and Salomaa. Results concerning Pa&h slender languages can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented for deciding whether or not a given context-free language is Parikh slender.
متن کاملOn N-algebraic Parikh slender power series
In a recent paper we introduced Parikh slender languages and series as a generalization of slender languages de ned and studied by Andra siu, Dassow, P aun and Salomaa. Results concerning Parikh slender series can be applied in ambiguity proofs of context-free languages. In this paper an algorithm is presented for deciding whether or not a given N-algebraic series is Parikh slender. Category: F...
متن کاملOn lengths of words in context-free languages
We consider slender languages, that is, languages for which the number of words of the same length is bounded from above by a constant. We prove that the slenderness problem is decidable for context-free languages and that the maximal number of words of the same length in a given context-free language is computable. Some e ective representations of slender context-free languages, as well as oth...
متن کاملA characterization of poly-slender context-free languages
For a non-negative integer k, we say that a language L is k-poly-slender if the number of words of length n in L is of order O(n k). We give a precise characterization of the k-poly-slender context-free languages. The well-known characterization of the k-poly-slender regular languages is an immediate consequence of ours.
متن کاملParikh's Theorem and Descriptional Complexity
This thesis was carried out in the Laboratorio di Linguaggi e Combinatoria (LIN.COM), at the Dipartimento di Informatica e Comunicazione, Università degli Studi di Milano. The thesis deals with some topics in the theory of formal languages, and specifically with the theory of context-free languages and the study of theirs descriptional complexity. The descriptional complexity of a formal struct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 255 شماره
صفحات -
تاریخ انتشار 2001